Focus points and convergent process operators: a proof strategy for protocol verification

Focus points and convergent process operators: a proof strategy for protocol verification

We present a strategy for nding algebraic correctness proofs for communication systems. It is described in the setting of CRL 11], which is, roughly, ACP 2, 3] extended with a formal treatment of the interaction between data and processes. The strategy has already been applied successfully in 4] and 10], but was not explicitly identiied as such. Moreover, the protocols that were veriied in thes...

Focus Points and Convergent Process Operators A Proof Strategy for Protocol Veri cation

We present a strategy for nding algebraic correctness proofs for communication systems It is described in the setting of CRL which is roughly ACP extended with a formal treatment of the interaction between data and processes The strategy has already been applied successfully in and but was not explicitly identi ed as such Moreover the protocols that were veri ed in these papers were rather comp...

points and convergent process operators

We present a strategy for nding algebraic correctness proofs for communication systems. It is described in the setting of CRL 11], which is, roughly, ACP 2, 3] extended with a formal treatment of the interaction between data and processes. The strategy has already been applied successfully in 4] and 10], but was not explicitly identiied as such. Moreover, the protocols that were veriied in thes...

Efficient strategy for Maximal Points Verification under Uncertainty

The study of algorithms that handle imprecise input data for which precise data can be requested is an interesting area. In the verification under uncertainty setting, an algorithm is given a set of imprecise input data and a set with the corresponding assumed precise data. An update request on some input reveals its precise value and it is verified if this matches the corresponding assumed val...

Proof verification and proof discovery for relativity